A General Asymptotic Scheme for Moments of Partition Statistics
نویسندگان
چکیده
Abstract. In order to compute means, variances and higher moments of various partition statistics, one often has to study generating functions of the form P (x)F (x), where P (x) is the generating function for the number of partitions. In this paper, we show how asymptotic expansions can be obtained in a quasi-automatic way from expansions of F (x) around x = 1. Numerous examples from the literature, as well as some new statistics are treated via this methodology. In addition, we show how to compute further terms in the asymptotic expansions of previously studied partition statistics.
منابع مشابه
A General Asymptotic Scheme for the Analysis of Partition Statistics
Dedicated to the memory of Philippe Flajolet We consider statistical properties of random integer partitions. In order to compute means, variances and higher moments of various partition statistics, one often has to study generating functions of the form P (x)F(x), where P (x) is the generating function for the number of partitions. In this paper, we show how asymptotic expansions can be obtain...
متن کاملIntroducing a New Lifetime Distribution of Power Series Distribution of the Family Gampertz
In this Paper, We propose a new three-parameter lifetime of Power Series distributions of the Family Gampertz with decreasing, increasing, increasing-decreasing and unimodal Shape failure rate. The distribution is a Compound version of of the Gampertz and Zero-truncated Possion distributions, called the Gampertz-Possion distribution (GPD). The density function, the hazard rate function, a gener...
متن کاملTaylor Coefficients of Mock-jacobi Forms and Moments of Partition Statistics
We develop a new technique for deriving asymptotic series expansions for moments of combinatorial generating functions that uses the transformation theory of Jacobi forms and “mock” Jacobi forms, as well as the Hardy-Ramanujan Circle Method. The approach builds on a suggestion of Zagier, who observed that the moments of a combinatorial statistic can be simultaneously encoded as the Taylor coeff...
متن کاملAsymptotics for Rank and Crank Moments
Moments of the partition rank and crank statistics have been studied for their connections to combinatorial objects such as Durfee symbols, as well as for their connections to harmonic Maass forms. This paper proves a conjecture due to two of the authors that re ned a conjecture of Garvan. Garvan's original conjecture states that the moments of the crank function are always larger than the mome...
متن کاملInequalities Between Ranks and Cranks
Higher moments of the partition rank and crank statistics have been studied for their connections to combinatorial objects such as Durfee symbols, as well as for their connections to harmonic Maass forms. This paper proves the first several cases of (and strengthens) a conjecture due to Garvan, which states that the moments of the crank function are always larger than the moments of the crank f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010